Comment on: On the Kung-Traub Conjecture for Iterative Methods for Solving Quadratic Equations. Algorithms 2016, 9, 1
نویسنده
چکیده
Kung-Traub conjecture states that an iterative method without memory for finding the simple zero of a scalar equation could achieve convergence order 2d−1, and d is the total number of function evaluations. In an article “Babajee, D.K.R. On the Kung-Traub Conjecture for Iterative Methods for Solving Quadratic Equations, Algorithms 2016, 9, 1, doi:10.3390/a9010001”, the author has shown that Kung-Traub conjecture is not valid for the quadratic equation and proposed an iterative method for the scalar and vector quadratic equations. In this comment, we have shown that we first reported the aforementioned iterative method.
منابع مشابه
On the Kung-Traub Conjecture for Iterative Methods for Solving Quadratic Equations
Kung-Traub’s conjecture states that an optimal iterative method based on d function evaluations for finding a simple zero of a nonlinear function could achieve a maximum convergence order of 2d−1. During the last years, many attempts have been made to prove this conjecture or develop optimal methods which satisfy the conjecture. We understand from the conjecture that the maximum order reached b...
متن کاملA new optimal method of fourth-order convergence for solving nonlinear equations
In this paper, we present a fourth order method for computing simple roots of nonlinear equations by using suitable Taylor and weight function approximation. The method is based on Weerakoon-Fernando method [S. Weerakoon, G.I. Fernando, A variant of Newton's method with third-order convergence, Appl. Math. Lett. 17 (2000) 87-93]. The method is optimal, as it needs three evaluations per iterate,...
متن کاملNew Eighth-Order Derivative-Free Methods for Solving Nonlinear Equations
A new family of eighth-order derivative-freemethods for solving nonlinear equations is presented. It is proved that these methods have the convergence order of eight. These new methods are derivative-free and only use four evaluations of the function per iteration. In fact, we have obtained the optimal order of convergence which supports the Kung and Traub conjecture. Kung and Traub conjectured...
متن کاملA new iterative with memory class for solving nonlinear equations
In this work we develop a new optimal without memory class for approximating a simple root of a nonlinear equation. This class includes three parameters. Therefore, we try to derive some with memory methods so that the convergence order increases as high as possible. Some numerical examples are also presented.
متن کاملAn Optimal Biparametric Multipoint Family and Its Self-Acceleration with Memory for Solving Nonlinear Equations
In this paper, a family of Steffensen-type methods of optimal order of convergence with two parameters is constructed by direct Newtonian interpolation. It satisfies the conjecture proposed by Kung and Traub (J. Assoc. Comput. Math. 1974, 21, 634–651) that an iterative method based on m evaluations per iteration without memory would arrive at the optimal convergence of order 2m−1. Furthermore, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Algorithms
دوره 9 شماره
صفحات -
تاریخ انتشار 2016